Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
41	CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:43:36 Combinatorial optimization Minimum spanning tree Spanning tree Job shop scheduling Maximum flow problem Max-flow min-cut theorem Cut Connectivity David Shmoys Graph theory Mathematics Theoretical computer science
42	Improved Approximation for the Directed Spanner Problem∗ Piotr Bermana , Arnab Bhattacharyyab,1 , Konstantin Makarychevc , Sofya Raskhodnikovaa,2 , Grigory Yaroslavtseva,2 a Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:08 Graph connectivity Combinatorial optimization Connectivity Shortest path problem Cut Bridge Maximum flow problem Eulerian path Graph theory Mathematics Theoretical computer science
43	SEGMENTATION OF ANATOMICAL BRANCHING STRUCTURES BASED ON TEXTURE FEATURES AND GRAPH CUT Tatyana Nuzhnaya1, Erkang Cheng2, Haibin Ling2, Despina Kontos3, Predrag R. Bakic3, Vasileios Megalooikonomou1 1 Add to Reading List Source URL: www.dabi.temple.edu Language: English - Date: 2011-01-27 21:56:28 Computer graphics Imaging Segmentation Mathematics Image texture Image segment Topology Active contour model Graph Image processing Computer vision Graph theory
44	On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:35 NP-complete problems Combinatorial optimization Graph connectivity Matching Maximum cut Directed acyclic graph Cut Bipartite graph Graph Graph theory Theoretical computer science Mathematics
45	Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2012-04-26 12:04:26 Network theory Graph connectivity Connectivity Cut Graph Maximum flow problem Shortest path problem Graph theory Mathematics Theoretical computer science
46	Algorithms Lecture 24: Applications of Maximum Flow [Fa’13] For a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:09 Combinatorial optimization Matching Maximum flow problem Matroid theory Flow network Cut Ford–Fulkerson algorithm Graph Bipartite graph Graph theory Mathematics Network flow
47	Algorithms Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:40 Spanning tree Combinatorial optimization Graph connectivity Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Connectivity Theoretical computer science Mathematics Graph theory
48	Formworks Pairing Optimization 1 Towards Optimal Formwork Pairing on Construction Sites Thierry Benoist Bouygues e-lab, Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2008-07-09 00:55:53 Multi-commodity flow problem Cut Bipartite graph Graph Graph theory Network flow Flow network
49	Optimization Algorithms Lecture 23: Maximum Flows and Minimum Cuts [Fa’13] Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:28 Combinatorics Maximum flow problem Ford–Fulkerson algorithm Flow network Edmonds–Karp algorithm Max-flow min-cut theorem Minimum cut Cut Graph Network flow Graph theory Mathematics
50	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics

UPDATE